Multiparty quantum communication complexity
نویسندگان
چکیده
منابع مشابه
Multiparty Quantum Communication Complexity
Quantum entanglement cannot be used to achieve direct communication between remote parties, but it can reduce the communication needed for some problems. Let each of k parties hold some partial input data to some fixed k-variable function f . The communication complexity of f is the minimum number of classical bits required to be broadcasted for every party to know the value of f on their input...
متن کاملMultiparty Quantum Communication Complexity of Triangle Finding
Triangle finding (deciding if a graph contains a triangle or not) is a central problem in quantum query complexity. The quantum communication complexity of this problem, where the edges of the graph are distributed among the players, was considered recently by Ivanyos et al. in the twoparty setting. In this paper we consider its k-party quantum communication complexity with k ≥ 3. Our main resu...
متن کاملExponential Quantum-Classical Gaps in Multiparty Nondeterministic Communication Complexity
There are three different types of nondeterminism in quantum communication: i) NQP-communication, ii) QMA-communication, and iii) QCMA-communication. In this paper we show that multiparty NQP-communication can be exponentially stronger than QCMA-communication. This also implies an exponential separation with respect to classical multiparty nondeterministic communication complexity. We argue tha...
متن کاملQuantum Multiparty Communication Complexity and Circuit Lower Bounds
We define a quantum model for multiparty communication complexity and prove a simulation theorem between the classical and quantum models. As a result, we show that if the quantum k-party communication complexity of a function f is Ω( n 2k ), then its classical k-party communication is Ω( n 2k/2 ). Finding such an f would allow us to prove strong classical lower bounds for k ≥ log n players and...
متن کاملMultiparty Communication Complexity of AC
We prove n lower bounds on the multiparty communication complexity of AC functions in the number-on-forehead (NOF) model for up to Θ(logn) players. These are the first lower bounds for any AC function for ω(log logn) players. In particular we show that there are families of depth 3 read-once AC formulas having k-player randomized multiparty NOF communication complexity n/2. We show similar lowe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 1999
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.60.2737